Pure Dominance Constraints
نویسندگان
چکیده
We present an efficient algorithm that checks the satisfiability of pure dominance constraints, which is a tree description language contained in several constraint languages studied in computational linguistics. Pure dominance constraints partially describe unlabeled rooted trees. For arbitrary pairs of nodes they specify sets of admissible relative positions in a tree. The task is to find a tree structure satisfying these constraints. Our algorithm constructs such a solution in time O(m) where m is the number of constraints. This solves an essential part of an open problem posed by Cornell.
منابع مشابه
Electricity Procurement for Large Consumers with Second Order Stochastic Dominance Constraints
This paper presents a decision making approach for mid-term scheduling of large industrial consumers based on the recently introduced class of Stochastic Dominance (SD)- constrained stochastic programming. In this study, the electricity price in the pool as well as the rate of availability (unavailability) of the generating unit (forced outage rate) is considered as uncertain parameters. Th...
متن کاملOrdinal dominance and risk aversion
We find that, for sufficiently risk-averse agents, strict dominance by pure or mixed actions coincides with dominance by pure actions in the sense of Börgers (1993), which, in turn, coincides with the classical notion of strict dominance by pure actions when preferences are asymmetric. Since risk-aversion is a cardinal feature, all finite single-agent choice problems with ordinal preferences ad...
متن کاملA Generic Method for Identifying and Exploiting Dominance Relations
Many constraint problems exhibit dominance relations which can be exploited for dramatic reductions in search space. Dominance relations are a generalization of symmetry and conditional symmetry. However, unlike symmetry breaking which is relatively well studied, dominance breaking techniques are not very well understood and are not commonly applied. In this paper, we present formal definitions...
متن کاملDominance Constraints and Dominance Graphs
Dominance constraints logically describe trees in terms of their adjacency and dominance, i.e. reachability, relation. They have important applications in computational linguistics. Unfortunately, the satisfiability problem of dominance constraints is NP-complete. In this extended abstract we describe efficient algorithms for natural subclasses of dominance constraints [BDNM03]. The instances o...
متن کاملDominance Constraints in Context Uni
Tree descriptions based on dominance constraints are popular in several areas of computational linguistics including syntax, semantics , and discourse. Tree descriptions in the language of context unii-cation have attracted some interest in uniication and rewriting theory. Recently, dominance constraints and context uniication have both been used in diierent underspeciied approaches to the sema...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002